Testing protocols modeled as FSMs with timing parameters

نویسندگان

  • M. Ümit Uyar
  • Mariusz A. Fecko
  • Adarshpal S. Sethi
  • Paul D. Amer
چکیده

An optimization method is introduced for generating minimum-length test sequences taking into account timing constraints for FSM models of communication protocols. Due to active timers in many of today’s protocols, the number of consecutive self-loops that can be traversed in a given state before a timeout occurs is limited. A test sequence that does not consider timing constraints will likely be unrealizable in a test laboratory, thereby potentially resulting in the incorrect failing of valid implementations (or, vice versa). The solution uses a series of augmentations for a protocol’s directed graph representation. The resulting test sequence is proven to be of minimum-length while not exceeding the tolerable limit of consecutive self-loops at each state. Although UIO sequences are used for state verification method, the results also are applicable to test generation that uses distinguishing or characterizing sequences.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Conformance Testing Method for Communication Protocols Modeled as Concurrent DFSMs

According to the progress of high-speed networks, many communication protocols are specified as concurrent systems. Such systems can be modeled as concurrent deterministic FSMs (DFSMs). In those protocols, a common input may be taken by some of concurrent DFSMs competitively. In such a case, the global behaviour becomes non-deterministic in general. Conformance testing is typically a black-box ...

متن کامل

Testing protocols modeled as FSMs with timing parameters 1 ̈

An optimization method is introduced for generating minimum-length test sequences taking into account timing constraints for FSM models of communication protocols. Due to active timers in many of today’s protocols, the number of consecutive self-loops that can be traversed in a given state before a timeout occurs is limited. A test sequence that does not consider timing constraints will likely ...

متن کامل

An Eclipse-based environment for conformance testing by FSMs

Finite state machines (FSMs) represent a very simple yet widely used formalism. They are used to model simple protocols or even complex systems in an abstract way. Java classes often behave like FSMs. For these reasons, FSMs are often used in conformance testing, which consists in checking that a real implementation conforms with its speci cation given in terms of a FSM. In this paper, we show ...

متن کامل

Test development for communication protocols: towards automation

In this paper we give an introduction to methods and tools for testing communication protocols and distributed systems. In this context, we try to answer the following questions: Why are we testing? What are we testing? Against what are we Ž testing?... We present the different approaches of test automation and explain the industrial point of view automatic test . Ž . execution and the research...

متن کامل

Distinguing Non-deterministic Timed Finite State Machines

Conformance testing with the guaranteed fault coverage is based on distinguishing faulty system implementations from the corresponding system specification. We consider timed systems modeled by timed possibly nondeterministic finite state machines (TFSMs) and propose algorithms for distinguishing two TFSMs. In particular, we present a preset algorithm for separating two separable TFSMs and an a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer Networks

دوره 31  شماره 

صفحات  -

تاریخ انتشار 1999